-
1 Figure 6.4 shows an example of the operation of heapsort after the max-heap is initially built
Общая лексика: На рис. 6.4 показан пример пирамидальной сортировки после предварительного построения невозрастающей пирамиды (см. Introduction to Algorithms (Second Editi)Универсальный англо-русский словарь > Figure 6.4 shows an example of the operation of heapsort after the max-heap is initially built
-
2 Nevertheless, the heap data structure itself has enormous utility
Общая лексика: Тем не менее, структура данных, использующаяся при пирамидальной сортировке, сама по себе имеет большую ценность (см. Introduction to Algorithms (Second Edition) by Thomas H. Cormen et)Универсальный англо-русский словарь > Nevertheless, the heap data structure itself has enormous utility
-
3 Now we discuss how to implement the operations of a max-priority queue
Общая лексика: Теперь перейдём к реализации операций в невозрастающей очереди с приоритетами (см. Introduction to Algorithms (Second Edition) by Thomas H. Cormen et al. (2001))Универсальный англо-русский словарь > Now we discuss how to implement the operations of a max-priority queue
-
4 Similarly, we need to store a handle to the corresponding heap element in each application object
Общая лексика: В каждом объекте приложения точно так же необходимо хранить идентификатор соответствующего элемента пирамиды (см. Introduction to Algorithms (Second Edi)Универсальный англо-русский словарь > Similarly, we need to store a handle to the corresponding heap element in each application object
См. также в других словарях:
Introduction to Algorithms — is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is used as the textbook for algorithms courses at many universities.Cormen teaches at Dartmouth College, Rivest and Leiserson teach at MIT, and Stein… … Wikipedia
Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… … Wikipedia
Analysis of algorithms — To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Navigational Algorithms — is a source of information whose purpose is to make available the scientific part of the art of navigation, containing specialized articles and software that implements the various procedures of calculus. The topics covered are: Celestial… … Wikipedia
Standard algorithms — In elementary arithmetic, a standard algorithm or method is an efficient manual method of computation which yields one correct answer, and has been traditionally taught over a long period of time. These methods vary somewhat by nation and time,… … Wikipedia
Cryptanalysis of TIA's Common Cryptographic Algorithms — In 1992, the TR 45 working group within the Telecommunications Industry Association (TIA) developed a standard for integration of cryptographic technology into tomorrow s digital cellular systems [TIA92] , which has been updated at least once… … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal … Wikipedia
